CLEAN

Etymology: see *

Home Page:
http://www.cs.kun.nl/~clean

                                     Concurrent Clean System

MAC NAME: Concurrent Clean System                                      

VERSION: 1.0.0                                 

README:
"The pure, lazy functional language Concurrent Clean (version 1.0) defined in this reference manual is a major upgrade of the previous release (0.84b) of Clean (Brus et al., 1987; Nöcker et al., 1991; Plasmeijer & van Eekelen, 1993).
Clean was originally designed as an experimental intermediate language and deliberately kept syntactically as poor as possible to be able to focus on the essential language and implementation issues. This strategy enabled us to study new concepts (such as term graph rewriting (Barendregt et al., 1987), lazy copying (van Eekelen et al., 1991), abstract reduction (Nöcker, 1993), uniqueness typing (Barendsen and Smetsers, 1993) without too much implementation effort. The ideas were tested in the Clean compiler which could be used on small machines and produced state-of-the-art code (Smetsers et al., 1991)."

AUTHORS:
mac port:
Achten (1992,1993)
Wichers Schreur (1989)
Huitema & Plasmeijer (1992)
    
COPYRIGHT:
(c) 1987 - 1995 University of Nijmegen, Computing Science Institute.

INTERNET SITES:
ftp://ftp.cs.kun.nl/pub/Clean/Clean10/mac/

Old versions:  
ftp://ftp.cs.kun.nl/pub/Clean/Clean08/mac/

* 
Date: Tue, 30 May 1995 10:03:45 +0200
To: "Antreas P. Hatzipolakis" <xpolakis@athena.compulink.forthnet.gr>
From: rinus@cs.kun.nl (rinus plasmeijer)

Dear Antreas,

You wrote:
>I have a question about the name:
>What is the etymology of CLEAN?

The history is as follows:
We designed graph rewriting systems together with our friends in East-Anglia (Sleep, Kennaway, Glauert). We also had a tiny language on top of it, called LEAN (the Language of East-Anglia and Nijmegen, 1987, Parle conference).
This language could do general graph rewriting (also useful for imperative languages and logic languages). However, in Nijmegen we want to restrict ourselves to functional languages and term-graph rewriting. So, we designed a "clean" version of LEAN, called CLEAN.

Greetings,

Rinus